Escaping the curse of dimensionality in estimating multivariate transfer entropy.

نویسندگان

  • Jakob Runge
  • Jobst Heitzig
  • Vladimir Petoukhov
  • Jürgen Kurths
چکیده

Multivariate transfer entropy (TE) is a model-free approach to detect causalities in multivariate time series. It is able to distinguish direct from indirect causality and common drivers without assuming any underlying model. But despite these advantages it has mostly been applied in a bivariate setting as it is hard to estimate reliably in high dimensions since its definition involves infinite vectors. To overcome this limitation, we propose to embed TE into the framework of graphical models and present a formula that decomposes TE into a sum of finite-dimensional contributions that we call decomposed transfer entropy. Graphical models further provide a richer picture because they also yield the causal coupling delays. To estimate the graphical model we suggest an iterative algorithm, a modified version of the PC-algorithm with a very low estimation dimension. We present an appropriate significance test and demonstrate the method's performance using examples of nonlinear stochastic delay-differential equations and observational climate data (sea level pressure).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Representation of Multivariate Extremes with Applications to Anomaly Ranking

Extremes play a special role in Anomaly Detection. Beyond inference and simulation purposes, probabilistic tools borrowed from Extreme Value Theory (EVT), such as the angular measure, can also be used to design novel statistical learning methods for Anomaly Detection/ranking. This paper proposes a new algorithm based on multivariate EVT to learn how to rank observations in a high dimensional sp...

متن کامل

Ensemble weighted kernel estimators for multivariate entropy estimation

The problem of estimation of entropy functionals of probability densities has received much attention in the information theory, machine learning and statistics communities. Kernel density plug-in estimators are simple, easy to implement and widely used for estimation of entropy. However, for large feature dimension d, kernel plug-in estimators suffer from the curse of dimensionality: the MSE r...

متن کامل

Single-index Di usion Models and Their Estimation

We propose a single-index di usion model in this paper. This model can avoid the `curse of dimensionality' in estimating a multivariate nonparametric conditional variance. We adopt an absolute deviation estimation method to estimate the model. Comparing with the commonly used estimators, the absolute deviation estimator is more stable and efcient. Some simulations and applications to real data ...

متن کامل

Escaping the Curse of Dimensionality with a Tree-based Regressor

We present the first tree-based regressor whose convergence rate depends only on the intrinsic dimension of the data, namely its Assouad dimension. The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees.

متن کامل

Multivariate construction of effective computational networks from observational data

We introduce a new method for inferring effective network structure given a multivariate timeseries of activation levels of the nodes in the network. For each destination node in the network, the method identifies the set of source nodes which can be used to provide the most statistically significant information regarding outcomes of the destination, and are thus inferred as those source inform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review letters

دوره 108 25  شماره 

صفحات  -

تاریخ انتشار 2012